From 2c7d38d75b408792a967bd8963850e2fd3214e9f Mon Sep 17 00:00:00 2001 From: robertl Date: Mon, 10 Nov 2003 15:13:57 +0000 Subject: [PATCH] This commit was generated by cvs2svn to compensate for changes in r548, which included commits to RCS files with non-trunk default branches. --- st2gpx/istorage/istorage.cpp | 261 ++++++ st2gpx/src/COPYING | 339 ++++++++ st2gpx/src/getopt.c | 1050 +++++++++++++++++++++++ st2gpx/src/getopt.h | 131 +++ st2gpx/src/pushpins.cpp | 224 +++++ st2gpx/src/pushpins.h | 96 +++ st2gpx/src/st2gpx.c | 1523 ++++++++++++++++++++++++++++++++++ st2gpx/src/st2gpx.dsp | 134 +++ st2gpx/src/st2gpx.dsw | 41 + 9 files changed, 3799 insertions(+) create mode 100644 st2gpx/istorage/istorage.cpp create mode 100644 st2gpx/src/COPYING create mode 100644 st2gpx/src/getopt.c create mode 100644 st2gpx/src/getopt.h create mode 100644 st2gpx/src/pushpins.cpp create mode 100644 st2gpx/src/pushpins.h create mode 100644 st2gpx/src/st2gpx.c create mode 100644 st2gpx/src/st2gpx.dsp create mode 100644 st2gpx/src/st2gpx.dsw diff --git a/st2gpx/istorage/istorage.cpp b/st2gpx/istorage/istorage.cpp new file mode 100644 index 000000000..995b85680 --- /dev/null +++ b/st2gpx/istorage/istorage.cpp @@ -0,0 +1,261 @@ +/*by Pabs (pabs3@zip.to, http://zip.to/pabs3) Nov 2001, April 2002*/ + +/*Licenced under the BSD sloppyright - nasty little daemons better not use this source & not attribute me*/ +/*Why BSD licence? HTFSIK but seriously I wanted to get to know more open/free licences*/ + +/*Compile notes: + M$VC: just open this file & press the build button or select build from the + build menu since this will create a default project that does nicely + GCC/Cygwin: gcc -mno-cygwin -fvtable-thunks -lole32 -o istorage.exe istorage.cpp should do the trick + if w32api & mingw are set up correctly & the headers are correct + GCC/Wine: You'll have to figure it out for yourself since I don't yet have + access to Linux (Debian) cause I need a new HD + a DVD drive ;-) +*/ + +/*Usage: + istorage some.doc some.xls some.pub some.fla some.chm + will extract each of these files to some.???.Contents directories + these are M$ Word, Excel and Publisher and Macromedia Flash source files (ooh and a compiled HTML Help file) +*/ + +/*TODO: + think up a proper name - unist??? or what?? + Add popt/getopt processing + reverse engineer the compound file format (& chm format - Matthew T. Russotto has already done some) + or just use libOLE - http://chicago.sf.net + so we don't depend on M$ for the implementation + Implement options for the following + -i string invalid chars + -f char replace invalid chars with + -n char indent with this char + -a string append this to each file opened + various tar/unzip options + --help --version +*/ + + +#include +#include +#include +#include + + +struct OPTIONS{ + char fixchar; + char* invalidchars; + char indentchar; + char* appendstring; +} options = {'.',"<>|/\\\"",'\t',".Contents"}; + +HRESULT r; + +DWORD level = 0; + +//These next few bits are from a sample available from http://www.keyworks.net/code.htm (see http://helpware.net/delphi/index.html for a Delphi sample - need to join a yahoo group first - example 10 is the one to look at) +//This stuff is supposed to be documented in the MSDN, but I only found 1 page that references ITStorage & that is an error codes list +DEFINE_GUID(CLSID_ITStorage, 0x5d02926a, 0x212e, 0x11d0, 0x9d, 0xf9, 0x0, 0xa0, 0xc9, 0x22, 0xe6, 0xec); +DEFINE_GUID(IID_ITStorage, 0x88cc31de, 0x27ab, 0x11d0, 0x9d, 0xf9, 0x0, 0xa0, 0xc9, 0x22, 0xe6, 0xec); + +const GUID CLSID_ITStorage = { 0x5d02926a, 0x212e, 0x11d0, { 0x9d, 0xf9, 0x0, 0xa0, 0xc9, 0x22, 0xe6, 0xec } }; +const GUID IID_ITStorage = { 0x88cc31de, 0x27ab, 0x11d0, { 0x9d, 0xf9, 0x0, 0xa0, 0xc9, 0x22, 0xe6, 0xec} }; + +typedef struct _ITS_Control_Data +{ + UINT cdwControlData; // Number of DWords to follow. + UINT adwControlData[1]; // Actually this will be adwControlData[cdwControlData] +} ITS_Control_Data, *PITS_Control_Data; + +typedef enum ECompactionLev { + COMPACT_DATA = 0, + COMPACT_DATA_AND_PATH +}; + +DECLARE_INTERFACE_(IITStorage, IUnknown) +{ + STDMETHOD(StgCreateDocfile) (const WCHAR* pwcsName, DWORD grfMode, DWORD reserved, IStorage** ppstgOpen) PURE; + STDMETHOD(StgCreateDocfileOnILockBytes) (ILockBytes * plkbyt, DWORD grfMode, DWORD reserved, IStorage** ppstgOpen) PURE; + STDMETHOD(StgIsStorageFile) (const WCHAR * pwcsName) PURE; + STDMETHOD(StgIsStorageILockBytes) (ILockBytes * plkbyt) PURE; + STDMETHOD(StgOpenStorage)(const WCHAR * pwcsName, IStorage * pstgPriority, DWORD grfMode, SNB snbExclude, DWORD reserved, IStorage ** ppstgOpen) PURE; + STDMETHOD(StgOpenStorageOnILockBytes)(ILockBytes * plkbyt, IStorage * pStgPriority, DWORD grfMode, SNB snbExclude, DWORD reserved, IStorage ** ppstgOpen) PURE; + STDMETHOD(StgSetTimes)(WCHAR const* lpszName, FILETIME const* pctime, FILETIME const* patime, FILETIME const* pmtime) PURE; + STDMETHOD(SetControlData)(PITS_Control_Data pControlData) PURE; + STDMETHOD(DefaultControlData)(PITS_Control_Data *ppControlData) PURE; + STDMETHOD(Compact)(const WCHAR* pwcsName, ECompactionLev iLev) PURE; +}; + +IITStorage* ITStorage = NULL; + +void EnumStorage(IStorage* is); +void fixpath(char* s); + +int main(int argc, char *argv[]){ + //Get an instance of the thing to call for opening chms + CoInitialize(NULL); + CoCreateInstance(CLSID_ITStorage, NULL, CLSCTX_INPROC_SERVER, IID_ITStorage, (void**)&ITStorage); + for(int i=1;iStgOpenStorage(wpath,NULL,STGM_READ|STGM_SHARE_DENY_WRITE,NULL,0,&is); + fputs("StgOpenStorage failed, trying chm version...",stderr); + } + delete[]wpath; wpath = NULL; + if( r == S_OK || is ){ + STATSTG ss; + if(S_OK==is->Stat(&ss,STATFLAG_NONAME))fprintf(stderr,"CLSID={%8.8X-%4.4X-%4.4X-%4.4X-%2.2X%2.2X%2.2X%2.2X%2.2X%2.2X} State=0x%8.8X reserved=0x%8.8X\n", ss.clsid.Data1, ss.clsid.Data2, ss.clsid.Data3, ss.clsid.Data4[0]<<8/*&0xff00*/| ss.clsid.Data4[1], ss.clsid.Data4[2], ss.clsid.Data4[3], ss.clsid.Data4[4], ss.clsid.Data4[5], ss.clsid.Data4[6], ss.clsid.Data4[7], ss.grfStateBits, ss.reserved); + else fputs("Stat failed\n",stderr); + char* path = new char[len+strlen(options.appendstring)+1]; + if(path){ + strcpy(path,argv[i]); + strcpy(&path[len],options.appendstring); + RemoveDirectory(path); + if(CreateDirectory(path,NULL)||GetLastError()==ERROR_ALREADY_EXISTS){ + if(SetCurrentDirectory(path)){ + delete[]path; path = NULL; + level++; + EnumStorage(is); + level--; + SetCurrentDirectory(".."); + } + else fputs("Could not enter - Ignoring & continuing\n",stderr); + } + else fputs("Could not create (directory) - Ignoring & continuing\n",stderr); + delete[]path; path = NULL; + } + else fputs("Could not alloc memory for the ANSI pathname for the wimpy Win9$ - Ignoring & continuing\n",stderr); + is->Release(); + } + else fputs("Could not open the specified file - Ignoring & continuing\n",stderr); + } + else fputs("Could not convert the path to Unicode for the Unicode only StgOpenStorage - Ignoring & continuing\n",stderr); + delete[]wpath; wpath = NULL; + } + else fputs("Could not alloc memory for the Unicode filename for the Unicode only StgOpenStorage - Ignoring & continuing",stderr); + } + if( ITStorage ) ITStorage->Release(); + CoUninitialize(); + fflush(stderr);//Helps with debugging + return 0; +} + +void EnumStorage(IStorage* is){ + IEnumSTATSTG* iess; + r = is->EnumElements(0,NULL,0,&iess); + if( r!= S_OK ) { fputs("Could not enumerate elements - Ignoring & continuing\n",stderr); return;} + STATSTG ss; + iess->Reset(); + for(;;){ + r=iess->Next(1,&ss,NULL); + if( r!= S_OK ) break; + for(DWORD i=0;iOpenStorage(ss.pwcsName,NULL,STGM_READ|STGM_SHARE_EXCLUSIVE,NULL,0,&is2); + CoTaskMemFree(ss.pwcsName); ss.pwcsName = NULL; + if( r == S_OK || is2 ){ + if(CreateDirectory(path,NULL)||(r=GetLastError())==ERROR_ALREADY_EXISTS){ + if(r==ERROR_ALREADY_EXISTS)fputs("Already exists (directory) - using anyway\n",stderr); + else fputs("Created (directory)\n",stderr); + HANDLE f = CreateFile(path,GENERIC_WRITE,0,NULL,CREATE_ALWAYS,FILE_ATTRIBUTE_NORMAL,NULL); + if(f!=INVALID_HANDLE_VALUE&&f!=0/*Fucking lying MSDN*/){ + if(!SetFileTime(f,&ss.ctime,&ss.atime,&ss.mtime))fputs("Could not set the creation, last modification or last access time\n",stderr); + CloseHandle(f); + } + if(SetCurrentDirectory(path)){ + delete[]path; path = NULL; + level++; + EnumStorage(is2); + level--; + SetCurrentDirectory(".."); + } + else fputs("Could not enter (directory) - Ignoring & continuing\n",stderr); + } + else fputs("Could not create (directory) - Ignoring & continuing\n",stderr); + is2->Release(); + } + else fputs("Could not open (directory) - Ignoring & continuing\n",stderr); + }break; + case STGTY_STREAM:{ + IStream* is2; + r = is->OpenStream(ss.pwcsName,NULL,STGM_READ|STGM_SHARE_EXCLUSIVE,0,&is2); + CoTaskMemFree(ss.pwcsName); ss.pwcsName = NULL; + if( r == S_OK ){ + HANDLE f = CreateFile(path,GENERIC_WRITE,0,NULL,CREATE_ALWAYS,FILE_ATTRIBUTE_NORMAL,NULL); + delete[]path; path = NULL; + if(f!=INVALID_HANDLE_VALUE&&f!=0/*Fucking lying MSDN*/){ + if(ERROR_ALREADY_EXISTS==GetLastError())fputs("Already exists (file) - overwriting\n",stderr); + else fputs("Created (file)\n",stderr); + //This bit, although a bit more complex than 1 byte at a time, is way faster + BYTE* p; + ULARGE_INTEGER i={0}; + DWORD nobm = (DWORD)ss.cbSize.QuadPart, nobr, nobw; + bool err; + for(;;){ + p = (BYTE*)malloc( nobm ); if(p)break; + nobm/=2; if(!nobm)break; + } + if(p){ + do{ + r=is2->Read(p,nobm,&nobr); + if(r!=S_OK&&nobm!=nobr){fputs("Read error (file) - terminating this file\n",stderr);err=true;}//read less than asked and there was an error other than EOF - MSDN says that the compound file implementation of Read returns S_OK if the end of the stream was reached during the read + nobw=0; + r=WriteFile(f,p,nobr,&nobw,NULL); + i.QuadPart+=nobw; + if(!r||nobr!=nobw){fputs("Write error (file) - terminating this file\n",stderr);err=true;} + } while (i.QuadPartRelease(); + } + else fputs("Could not open (file) - Ignoring & continuing\n",stderr); + }break; + case STGTY_LOCKBYTES: + fputs("unsupported ILockBytes object - Ignoring & continuing\n",stderr); + break; + case STGTY_PROPERTY: + fputs("unsupported property storage object - Ignoring & continuing\n",stderr); + break; + default: + fputs("unknown object - Ignoring & continuing\n",stderr); + break; + } + } + else fputs("Could not convert the path back to ANSI for the wimpy Win9$ - Ignoring & continuing\n",stderr); + delete[]path; path = NULL; + } + else fputs("Could not alloc memory for the ANSI pathname for the wimpy Win9$ - Ignoring & continuing\n",stderr); + CoTaskMemFree(ss.pwcsName); ss.pwcsName = NULL; + } + iess->Release(); +} + +void fixpath(char* s){ + while(*s){//*s<32 || should probably be removed on non-FAT file systems + if( *s<32 || strchr(options.invalidchars,*s) )*s=options.fixchar; + s++; + } +} \ No newline at end of file diff --git a/st2gpx/src/COPYING b/st2gpx/src/COPYING new file mode 100644 index 000000000..4567e4480 --- /dev/null +++ b/st2gpx/src/COPYING @@ -0,0 +1,339 @@ + GNU GENERAL PUBLIC LICENSE + Version 2, June 1991 + + Copyright (C) 1989, 1991 Free Software Foundation, Inc. + 59 Temple Place - Suite 330, Boston, MA 02111 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +License is intended to guarantee your freedom to share and change free +software--to make sure the software is free for all its users. This +General Public License applies to most of the Free Software +Foundation's software and to any other program whose authors commit to +using it. (Some other Free Software Foundation software is covered by +the GNU Library General Public License instead.) You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +this service if you wish), that you receive source code or can get it +if you want it, that you can change the software or use pieces of it +in new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid +anyone to deny you these rights or to ask you to surrender the rights. +These restrictions translate to certain responsibilities for you if you +distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must give the recipients all the rights that +you have. You must make sure that they, too, receive or can get the +source code. And you must show them these terms so they know their +rights. + + We protect your rights with two steps: (1) copyright the software, and +(2) offer you this license which gives you legal permission to copy, +distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain +that everyone understands that there is no warranty for this free +software. If the software is modified by someone else and passed on, we +want its recipients to know that what they have is not the original, so +that any problems introduced by others will not reflect on the original +authors' reputations. + + Finally, any free program is threatened constantly by software +patents. We wish to avoid the danger that redistributors of a free +program will individually obtain patent licenses, in effect making the +program proprietary. To prevent this, we have made it clear that any +patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and +modification follow. + + GNU GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License applies to any program or other work which contains +a notice placed by the copyright holder saying it may be distributed +under the terms of this General Public License. The "Program", below, +refers to any such program or work, and a "work based on the Program" +means either the Program or any derivative work under copyright law: +that is to say, a work containing the Program or a portion of it, +either verbatim or with modifications and/or translated into another +language. (Hereinafter, translation is included without limitation in +the term "modification".) Each licensee is addressed as "you". + +Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running the Program is not restricted, and the output from the Program +is covered only if its contents constitute a work based on the +Program (independent of having been made by running the Program). +Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's +source code as you receive it, in any medium, provided that you +conspicuously and appropriately publish on each copy an appropriate +copyright notice and disclaimer of warranty; keep intact all the +notices that refer to this License and to the absence of any warranty; +and give any other recipients of the Program a copy of this License +along with the Program. + +You may charge a fee for the physical act of transferring a copy, and +you may at your option offer warranty protection in exchange for a fee. + + 2. You may modify your copy or copies of the Program or any portion +of it, thus forming a work based on the Program, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b) You must cause any work that you distribute or publish, that in + whole or in part contains or is derived from the Program or any + part thereof, to be licensed as a whole at no charge to all third + parties under the terms of this License. + + c) If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display an + announcement including an appropriate copyright notice and a + notice that there is no warranty (or else, saying that you provide + a warranty) and that users may redistribute the program under + these conditions, and telling the user how to view a copy of this + License. (Exception: if the Program itself is interactive but + does not normally print such an announcement, your work based on + the Program is not required to print an announcement.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Program, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Program, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Program. + +In addition, mere aggregation of another work not based on the Program +with the Program (or with a work based on the Program) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, +under Section 2) in object code or executable form under the terms of +Sections 1 and 2 above provided that you also do one of the following: + + a) Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of Sections + 1 and 2 above on a medium customarily used for software interchange; or, + + b) Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a medium + customarily used for software interchange; or, + + c) Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with such + an offer, in accord with Subsection b above.) + +The source code for a work means the preferred form of the work for +making modifications to it. For an executable work, complete source +code means all the source code for all modules it contains, plus any +associated interface definition files, plus the scripts used to +control compilation and installation of the executable. However, as a +special exception, the source code distributed need not include +anything that is normally distributed (in either source or binary +form) with the major components (compiler, kernel, and so on) of the +operating system on which the executable runs, unless that component +itself accompanies the executable. + +If distribution of executable or object code is made by offering +access to copy from a designated place, then offering equivalent +access to copy the source code from the same place counts as +distribution of the source code, even though third parties are not +compelled to copy the source along with the object code. + + 4. You may not copy, modify, sublicense, or distribute the Program +except as expressly provided under this License. Any attempt +otherwise to copy, modify, sublicense or distribute the Program is +void, and will automatically terminate your rights under this License. +However, parties who have received copies, or rights, from you under +this License will not have their licenses terminated so long as such +parties remain in full compliance. + + 5. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Program or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Program (or any work based on the +Program), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the +Program), the recipient automatically receives a license from the +original licensor to copy, distribute or modify the Program subject to +these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties to +this License. + + 7. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Program at all. For example, if a patent +license would not permit royalty-free redistribution of the Program by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Program. + +If any portion of this section is held invalid or unenforceable under +any particular circumstance, the balance of the section is intended to +apply and the section as a whole is intended to apply in other +circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system, which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 8. If the distribution and/or use of the Program is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Program under this License +may add an explicit geographical distribution limitation excluding +those countries, so that distribution is permitted only in or among +countries not thus excluded. In such case, this License incorporates +the limitation as if written in the body of this License. + + 9. The Free Software Foundation may publish revised and/or new versions +of the General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + +Each version is given a distinguishing version number. If the Program +specifies a version number of this License which applies to it and "any +later version", you have the option of following the terms and conditions +either of that version or of any later version published by the Free +Software Foundation. If the Program does not specify a version number of +this License, you may choose any version ever published by the Free Software +Foundation. + + 10. If you wish to incorporate parts of the Program into other free +programs whose distribution conditions are different, write to the author +to ask for permission. For software which is copyrighted by the Free +Software Foundation, write to the Free Software Foundation; we sometimes +make exceptions for this. Our decision will be guided by the two goals +of preserving the free status of all derivatives of our free software and +of promoting the sharing and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY +FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN +OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES +PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED +OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS +TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE +PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, +REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR +REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, +INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING +OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED +TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY +YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER +PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE +POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS + + Appendix: How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) 19yy + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111 USA + +Also add information on how to contact you by electronic and paper mail. + +If the program is interactive, make it output a short notice like this +when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) 19yy name of author + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, the commands you use may +be called something other than `show w' and `show c'; they could even be +mouse-clicks or menu items--whatever suits your program. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the program, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the program + `Gnomovision' (which makes passes at compilers) written by James Hacker. + + , 1 April 1989 + Ty Coon, President of Vice + +This General Public License does not permit incorporating your program into +proprietary programs. If your program is a subroutine library, you may +consider it more useful to permit linking proprietary applications with the +library. If this is what you want to do, use the GNU Library General +Public License instead of this License. diff --git a/st2gpx/src/getopt.c b/st2gpx/src/getopt.c new file mode 100644 index 000000000..59b51cd67 --- /dev/null +++ b/st2gpx/src/getopt.c @@ -0,0 +1,1050 @@ +/* Getopt for GNU. + NOTE: getopt is now part of the C library, so if you don't know what + "Keep this file name-space clean" means, talk to roland@gnu.ai.mit.edu + before changing it! + + Copyright (C) 1987, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97 + Free Software Foundation, Inc. + + The GNU C Library is free software; you can redistribute it and/or + modify it under the terms of the GNU Library General Public License as + published by the Free Software Foundation; either version 2 of the + License, or (at your option) any later version. + + The GNU C Library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Library General Public License for more details. + + You should have received a copy of the GNU Library General Public + License along with the GNU C Library; see the file COPYING.LIB. If not, + write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, + Boston, MA 02111-1307, USA. */ + +/* This tells Alpha OSF/1 not to define a getopt prototype in . + Ditto for AIX 3.2 and . */ +#ifndef _NO_PROTO +#define _NO_PROTO +#endif + +#ifdef HAVE_CONFIG_H +#include +#endif + +#if !defined (__STDC__) || !__STDC__ +/* This is a separate conditional since some stdc systems + reject `defined (const)'. */ +#ifndef const +#define const +#endif +#endif + +#include + +/* Comment out all this code if we are using the GNU C Library, and are not + actually compiling the library itself. This code is part of the GNU C + Library, but also included in many other GNU distributions. Compiling + and linking in this code is a waste when using the GNU C library + (especially if it is a shared library). Rather than having every GNU + program understand `configure --with-gnu-libc' and omit the object files, + it is simpler to just do this in the source for each such file. */ + +#define GETOPT_INTERFACE_VERSION 2 +#if !defined (_LIBC) && defined (__GLIBC__) && __GLIBC__ >= 2 +#include +#if _GNU_GETOPT_INTERFACE_VERSION == GETOPT_INTERFACE_VERSION +#define ELIDE_CODE +#endif +#endif + +#ifndef ELIDE_CODE + + +/* This needs to come after some library #include + to get __GNU_LIBRARY__ defined. */ +#ifdef __GNU_LIBRARY__ +/* Don't include stdlib.h for non-GNU C libraries because some of them + contain conflicting prototypes for getopt. */ +#include +#include +#endif /* GNU C library. */ + +#ifdef VMS +#include +#if HAVE_STRING_H - 0 +#include +#endif +#endif + +#if defined (WIN32) && !defined (__CYGWIN32__) +/* It's not Unix, really. See? Capital letters. */ +#include +#define getpid() GetCurrentProcessId() +#endif + +#ifndef _ +/* This is for other GNU distributions with internationalized messages. + When compiling libc, the _ macro is predefined. */ +#ifdef HAVE_LIBINTL_H +# include +# define _(msgid) gettext (msgid) +#else +# define _(msgid) (msgid) +#endif +#endif + +/* This version of `getopt' appears to the caller like standard Unix `getopt' + but it behaves differently for the user, since it allows the user + to intersperse the options with the other arguments. + + As `getopt' works, it permutes the elements of ARGV so that, + when it is done, all the options precede everything else. Thus + all application programs are extended to handle flexible argument order. + + Setting the environment variable POSIXLY_CORRECT disables permutation. + Then the behavior is completely standard. + + GNU application programs can use a third alternative mode in which + they can distinguish the relative order of options and other arguments. */ + +#include "getopt.h" + +/* For communication from `getopt' to the caller. + When `getopt' finds an option that takes an argument, + the argument value is returned here. + Also, when `ordering' is RETURN_IN_ORDER, + each non-option ARGV-element is returned here. */ + +char *optarg = NULL; + +/* Index in ARGV of the next element to be scanned. + This is used for communication to and from the caller + and for communication between successive calls to `getopt'. + + On entry to `getopt', zero means this is the first call; initialize. + + When `getopt' returns -1, this is the index of the first of the + non-option elements that the caller should itself scan. + + Otherwise, `optind' communicates from one call to the next + how much of ARGV has been scanned so far. */ + +/* 1003.2 says this must be 1 before any call. */ +int optind = 1; + +/* Formerly, initialization of getopt depended on optind==0, which + causes problems with re-calling getopt as programs generally don't + know that. */ + +int __getopt_initialized = 0; + +/* The next char to be scanned in the option-element + in which the last option character we returned was found. + This allows us to pick up the scan where we left off. + + If this is zero, or a null string, it means resume the scan + by advancing to the next ARGV-element. */ + +static char *nextchar; + +/* Callers store zero here to inhibit the error message + for unrecognized options. */ + +int opterr = 1; + +/* Set to an option character which was unrecognized. + This must be initialized on some systems to avoid linking in the + system's own getopt implementation. */ + +int optopt = '?'; + +/* Describe how to deal with options that follow non-option ARGV-elements. + + If the caller did not specify anything, + the default is REQUIRE_ORDER if the environment variable + POSIXLY_CORRECT is defined, PERMUTE otherwise. + + REQUIRE_ORDER means don't recognize them as options; + stop option processing when the first non-option is seen. + This is what Unix does. + This mode of operation is selected by either setting the environment + variable POSIXLY_CORRECT, or using `+' as the first character + of the list of option characters. + + PERMUTE is the default. We permute the contents of ARGV as we scan, + so that eventually all the non-options are at the end. This allows options + to be given in any order, even with programs that were not written to + expect this. + + RETURN_IN_ORDER is an option available to programs that were written + to expect options and other ARGV-elements in any order and that care about + the ordering of the two. We describe each non-option ARGV-element + as if it were the argument of an option with character code 1. + Using `-' as the first character of the list of option characters + selects this mode of operation. + + The special argument `--' forces an end of option-scanning regardless + of the value of `ordering'. In the case of RETURN_IN_ORDER, only + `--' can cause `getopt' to return -1 with `optind' != ARGC. */ + +static enum +{ + REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER +} ordering; + +/* Value of POSIXLY_CORRECT environment variable. */ +static char *posixly_correct; + +#ifdef __GNU_LIBRARY__ +/* We want to avoid inclusion of string.h with non-GNU libraries + because there are many ways it can cause trouble. + On some systems, it contains special magic macros that don't work + in GCC. */ +#include +#define my_index strchr +#else + +/* Avoid depending on library functions or files + whose names are inconsistent. */ + +char *getenv (); + +static char * +my_index (str, chr) + const char *str; + int chr; +{ + while (*str) + { + if (*str == chr) + return (char *) str; + str++; + } + return 0; +} + +/* If using GCC, we can safely declare strlen this way. + If not using GCC, it is ok not to declare it. */ +#ifdef __GNUC__ +/* Note that Motorola Delta 68k R3V7 comes with GCC but not stddef.h. + That was relevant to code that was here before. */ +#if !defined (__STDC__) || !__STDC__ +/* gcc with -traditional declares the built-in strlen to return int, + and has done so at least since version 2.4.5. -- rms. */ +extern int strlen (const char *); +#endif /* not __STDC__ */ +#endif /* __GNUC__ */ + +#endif /* not __GNU_LIBRARY__ */ + +/* Handle permutation of arguments. */ + +/* Describe the part of ARGV that contains non-options that have + been skipped. `first_nonopt' is the index in ARGV of the first of them; + `last_nonopt' is the index after the last of them. */ + +static int first_nonopt; +static int last_nonopt; + +#ifdef _LIBC +/* Bash 2.0 gives us an environment variable containing flags + indicating ARGV elements that should not be considered arguments. */ + +/* Defined in getopt_init.c */ +extern char *__getopt_nonoption_flags; + +static int nonoption_flags_max_len; +static int nonoption_flags_len; + +static int original_argc; +static char *const *original_argv; + +extern pid_t __libc_pid; + +/* Make sure the environment variable bash 2.0 puts in the environment + is valid for the getopt call we must make sure that the ARGV passed + to getopt is that one passed to the process. */ +static void +__attribute__ ((unused)) +store_args_and_env (int argc, char *const *argv) +{ + /* XXX This is no good solution. We should rather copy the args so + that we can compare them later. But we must not use malloc(3). */ + original_argc = argc; + original_argv = argv; +} +text_set_element (__libc_subinit, store_args_and_env); + +# define SWAP_FLAGS(ch1, ch2) \ + if (nonoption_flags_len > 0) \ + { \ + char __tmp = __getopt_nonoption_flags[ch1]; \ + __getopt_nonoption_flags[ch1] = __getopt_nonoption_flags[ch2]; \ + __getopt_nonoption_flags[ch2] = __tmp; \ + } +#else /* !_LIBC */ +# define SWAP_FLAGS(ch1, ch2) +#endif /* _LIBC */ + +/* Exchange two adjacent subsequences of ARGV. + One subsequence is elements [first_nonopt,last_nonopt) + which contains all the non-options that have been skipped so far. + The other is elements [last_nonopt,optind), which contains all + the options processed since those non-options were skipped. + + `first_nonopt' and `last_nonopt' are relocated so that they describe + the new indices of the non-options in ARGV after they are moved. */ + +#if defined (__STDC__) && __STDC__ +static void exchange (char **); +#endif + +static void +exchange (argv) + char **argv; +{ + int bottom = first_nonopt; + int middle = last_nonopt; + int top = optind; + char *tem; + + /* Exchange the shorter segment with the far end of the longer segment. + That puts the shorter segment into the right place. + It leaves the longer segment in the right place overall, + but it consists of two parts that need to be swapped next. */ + +#ifdef _LIBC + /* First make sure the handling of the `__getopt_nonoption_flags' + string can work normally. Our top argument must be in the range + of the string. */ + if (nonoption_flags_len > 0 && top >= nonoption_flags_max_len) + { + /* We must extend the array. The user plays games with us and + presents new arguments. */ + char *new_str = malloc (top + 1); + if (new_str == NULL) + nonoption_flags_len = nonoption_flags_max_len = 0; + else + { + memcpy (new_str, __getopt_nonoption_flags, nonoption_flags_max_len); + memset (&new_str[nonoption_flags_max_len], '\0', + top + 1 - nonoption_flags_max_len); + nonoption_flags_max_len = top + 1; + __getopt_nonoption_flags = new_str; + } + } +#endif + + while (top > middle && middle > bottom) + { + if (top - middle > middle - bottom) + { + /* Bottom segment is the short one. */ + int len = middle - bottom; + register int i; + + /* Swap it with the top part of the top segment. */ + for (i = 0; i < len; i++) + { + tem = argv[bottom + i]; + argv[bottom + i] = argv[top - (middle - bottom) + i]; + argv[top - (middle - bottom) + i] = tem; + SWAP_FLAGS (bottom + i, top - (middle - bottom) + i); + } + /* Exclude the moved bottom segment from further swapping. */ + top -= len; + } + else + { + /* Top segment is the short one. */ + int len = top - middle; + register int i; + + /* Swap it with the bottom part of the bottom segment. */ + for (i = 0; i < len; i++) + { + tem = argv[bottom + i]; + argv[bottom + i] = argv[middle + i]; + argv[middle + i] = tem; + SWAP_FLAGS (bottom + i, middle + i); + } + /* Exclude the moved top segment from further swapping. */ + bottom += len; + } + } + + /* Update records for the slots the non-options now occupy. */ + + first_nonopt += (optind - last_nonopt); + last_nonopt = optind; +} + +/* Initialize the internal data when the first call is made. */ + +#if defined (__STDC__) && __STDC__ +static const char *_getopt_initialize (int, char *const *, const char *); +#endif +static const char * +_getopt_initialize (argc, argv, optstring) + int argc; + char *const *argv; + const char *optstring; +{ + /* Start processing options with ARGV-element 1 (since ARGV-element 0 + is the program name); the sequence of previously skipped + non-option ARGV-elements is empty. */ + + first_nonopt = last_nonopt = optind; + + nextchar = NULL; + + posixly_correct = getenv ("POSIXLY_CORRECT"); + + /* Determine how to handle the ordering of options and nonoptions. */ + + if (optstring[0] == '-') + { + ordering = RETURN_IN_ORDER; + ++optstring; + } + else if (optstring[0] == '+') + { + ordering = REQUIRE_ORDER; + ++optstring; + } + else if (posixly_correct != NULL) + ordering = REQUIRE_ORDER; + else + ordering = PERMUTE; + +#ifdef _LIBC + if (posixly_correct == NULL + && argc == original_argc && argv == original_argv) + { + if (nonoption_flags_max_len == 0) + { + if (__getopt_nonoption_flags == NULL + || __getopt_nonoption_flags[0] == '\0') + nonoption_flags_max_len = -1; + else + { + const char *orig_str = __getopt_nonoption_flags; + int len = nonoption_flags_max_len = strlen (orig_str); + if (nonoption_flags_max_len < argc) + nonoption_flags_max_len = argc; + __getopt_nonoption_flags = + (char *) malloc (nonoption_flags_max_len); + if (__getopt_nonoption_flags == NULL) + nonoption_flags_max_len = -1; + else + { + memcpy (__getopt_nonoption_flags, orig_str, len); + memset (&__getopt_nonoption_flags[len], '\0', + nonoption_flags_max_len - len); + } + } + } + nonoption_flags_len = nonoption_flags_max_len; + } + else + nonoption_flags_len = 0; +#endif + + return optstring; +} + +/* Scan elements of ARGV (whose length is ARGC) for option characters + given in OPTSTRING. + + If an element of ARGV starts with '-', and is not exactly "-" or "--", + then it is an option element. The characters of this element + (aside from the initial '-') are option characters. If `getopt' + is called repeatedly, it returns successively each of the option characters + from each of the option elements. + + If `getopt' finds another option character, it returns that character, + updating `optind' and `nextchar' so that the next call to `getopt' can + resume the scan with the following option character or ARGV-element. + + If there are no more option characters, `getopt' returns -1. + Then `optind' is the index in ARGV of the first ARGV-element + that is not an option. (The ARGV-elements have been permuted + so that those that are not options now come last.) + + OPTSTRING is a string containing the legitimate option characters. + If an option character is seen that is not listed in OPTSTRING, + return '?' after printing an error message. If you set `opterr' to + zero, the error message is suppressed but we still return '?'. + + If a char in OPTSTRING is followed by a colon, that means it wants an arg, + so the following text in the same ARGV-element, or the text of the following + ARGV-element, is returned in `optarg'. Two colons mean an option that + wants an optional arg; if there is text in the current ARGV-element, + it is returned in `optarg', otherwise `optarg' is set to zero. + + If OPTSTRING starts with `-' or `+', it requests different methods of + handling the non-option ARGV-elements. + See the comments about RETURN_IN_ORDER and REQUIRE_ORDER, above. + + Long-named options begin with `--' instead of `-'. + Their names may be abbreviated as long as the abbreviation is unique + or is an exact match for some defined option. If they have an + argument, it follows the option name in the same ARGV-element, separated + from the option name by a `=', or else the in next ARGV-element. + When `getopt' finds a long-named option, it returns 0 if that option's + `flag' field is nonzero, the value of the option's `val' field + if the `flag' field is zero. + + The elements of ARGV aren't really const, because we permute them. + But we pretend they're const in the prototype to be compatible + with other systems. + + LONGOPTS is a vector of `struct option' terminated by an + element containing a name which is zero. + + LONGIND returns the index in LONGOPT of the long-named option found. + It is only valid when a long-named option has been found by the most + recent call. + + If LONG_ONLY is nonzero, '-' as well as '--' can introduce + long-named options. */ + +int +_getopt_internal (argc, argv, optstring, longopts, longind, long_only) + int argc; + char *const *argv; + const char *optstring; + const struct option *longopts; + int *longind; + int long_only; +{ + optarg = NULL; + + if (optind == 0 || !__getopt_initialized) + { + if (optind == 0) + optind = 1; /* Don't scan ARGV[0], the program name. */ + optstring = _getopt_initialize (argc, argv, optstring); + __getopt_initialized = 1; + } + + /* Test whether ARGV[optind] points to a non-option argument. + Either it does not have option syntax, or there is an environment flag + from the shell indicating it is not an option. The later information + is only used when the used in the GNU libc. */ +#ifdef _LIBC +#define NONOPTION_P (argv[optind][0] != '-' || argv[optind][1] == '\0' \ + || (optind < nonoption_flags_len \ + && __getopt_nonoption_flags[optind] == '1')) +#else +#define NONOPTION_P (argv[optind][0] != '-' || argv[optind][1] == '\0') +#endif + + if (nextchar == NULL || *nextchar == '\0') + { + /* Advance to the next ARGV-element. */ + + /* Give FIRST_NONOPT & LAST_NONOPT rational values if OPTIND has been + moved back by the user (who may also have changed the arguments). */ + if (last_nonopt > optind) + last_nonopt = optind; + if (first_nonopt > optind) + first_nonopt = optind; + + if (ordering == PERMUTE) + { + /* If we have just processed some options following some non-options, + exchange them so that the options come first. */ + + if (first_nonopt != last_nonopt && last_nonopt != optind) + exchange ((char **) argv); + else if (last_nonopt != optind) + first_nonopt = optind; + + /* Skip any additional non-options + and extend the range of non-options previously skipped. */ + + while (optind < argc && NONOPTION_P) + optind++; + last_nonopt = optind; + } + + /* The special ARGV-element `--' means premature end of options. + Skip it like a null option, + then exchange with previous non-options as if it were an option, + then skip everything else like a non-option. */ + + if (optind != argc && !strcmp (argv[optind], "--")) + { + optind++; + + if (first_nonopt != last_nonopt && last_nonopt != optind) + exchange ((char **) argv); + else if (first_nonopt == last_nonopt) + first_nonopt = optind; + last_nonopt = argc; + + optind = argc; + } + + /* If we have done all the ARGV-elements, stop the scan + and back over any non-options that we skipped and permuted. */ + + if (optind == argc) + { + /* Set the next-arg-index to point at the non-options + that we previously skipped, so the caller will digest them. */ + if (first_nonopt != last_nonopt) + optind = first_nonopt; + return -1; + } + + /* If we have come to a non-option and did not permute it, + either stop the scan or describe it to the caller and pass it by. */ + + if (NONOPTION_P) + { + if (ordering == REQUIRE_ORDER) + return -1; + optarg = argv[optind++]; + return 1; + } + + /* We have found another option-ARGV-element. + Skip the initial punctuation. */ + + nextchar = (argv[optind] + 1 + + (longopts != NULL && argv[optind][1] == '-')); + } + + /* Decode the current option-ARGV-element. */ + + /* Check whether the ARGV-element is a long option. + + If long_only and the ARGV-element has the form "-f", where f is + a valid short option, don't consider it an abbreviated form of + a long option that starts with f. Otherwise there would be no + way to give the -f short option. + + On the other hand, if there's a long option "fubar" and + the ARGV-element is "-fu", do consider that an abbreviation of + the long option, just like "--fu", and not "-f" with arg "u". + + This distinction seems to be the most useful approach. */ + + if (longopts != NULL + && (argv[optind][1] == '-' + || (long_only && (argv[optind][2] || !my_index (optstring, argv[optind][1]))))) + { + char *nameend; + const struct option *p; + const struct option *pfound = NULL; + int exact = 0; + int ambig = 0; + int indfound = -1; + int option_index; + + for (nameend = nextchar; *nameend && *nameend != '='; nameend++) + /* Do nothing. */ ; + + /* Test all long options for either exact match + or abbreviated matches. */ + for (p = longopts, option_index = 0; p->name; p++, option_index++) + if (!strncmp (p->name, nextchar, nameend - nextchar)) + { + if ((unsigned int) (nameend - nextchar) + == (unsigned int) strlen (p->name)) + { + /* Exact match found. */ + pfound = p; + indfound = option_index; + exact = 1; + break; + } + else if (pfound == NULL) + { + /* First nonexact match found. */ + pfound = p; + indfound = option_index; + } + else + /* Second or later nonexact match found. */ + ambig = 1; + } + + if (ambig && !exact) + { + if (opterr) + fprintf (stderr, _("%s: option `%s' is ambiguous\n"), + argv[0], argv[optind]); + nextchar += strlen (nextchar); + optind++; + optopt = 0; + return '?'; + } + + if (pfound != NULL) + { + option_index = indfound; + optind++; + if (*nameend) + { + /* Don't test has_arg with >, because some C compilers don't + allow it to be used on enums. */ + if (pfound->has_arg) + optarg = nameend + 1; + else + { + if (opterr) + if (argv[optind - 1][1] == '-') + /* --option */ + fprintf (stderr, + _("%s: option `--%s' doesn't allow an argument\n"), + argv[0], pfound->name); + else + /* +option or -option */ + fprintf (stderr, + _("%s: option `%c%s' doesn't allow an argument\n"), + argv[0], argv[optind - 1][0], pfound->name); + + nextchar += strlen (nextchar); + + optopt = pfound->val; + return '?'; + } + } + else if (pfound->has_arg == 1) + { + if (optind < argc) + optarg = argv[optind++]; + else + { + if (opterr) + fprintf (stderr, + _("%s: option `%s' requires an argument\n"), + argv[0], argv[optind - 1]); + nextchar += strlen (nextchar); + optopt = pfound->val; + return optstring[0] == ':' ? ':' : '?'; + } + } + nextchar += strlen (nextchar); + if (longind != NULL) + *longind = option_index; + if (pfound->flag) + { + *(pfound->flag) = pfound->val; + return 0; + } + return pfound->val; + } + + /* Can't find it as a long option. If this is not getopt_long_only, + or the option starts with '--' or is not a valid short + option, then it's an error. + Otherwise interpret it as a short option. */ + if (!long_only || argv[optind][1] == '-' + || my_index (optstring, *nextchar) == NULL) + { + if (opterr) + { + if (argv[optind][1] == '-') + /* --option */ + fprintf (stderr, _("%s: unrecognized option `--%s'\n"), + argv[0], nextchar); + else + /* +option or -option */ + fprintf (stderr, _("%s: unrecognized option `%c%s'\n"), + argv[0], argv[optind][0], nextchar); + } + nextchar = (char *) ""; + optind++; + optopt = 0; + return '?'; + } + } + + /* Look at and handle the next short option-character. */ + + { + char c = *nextchar++; + char *temp = my_index (optstring, c); + + /* Increment `optind' when we start to process its last character. */ + if (*nextchar == '\0') + ++optind; + + if (temp == NULL || c == ':') + { + if (opterr) + { + if (posixly_correct) + /* 1003.2 specifies the format of this message. */ + fprintf (stderr, _("%s: illegal option -- %c\n"), + argv[0], c); + else + fprintf (stderr, _("%s: invalid option -- %c\n"), + argv[0], c); + } + optopt = c; + return '?'; + } + /* Convenience. Treat POSIX -W foo same as long option --foo */ + if (temp[0] == 'W' && temp[1] == ';') + { + char *nameend; + const struct option *p; + const struct option *pfound = NULL; + int exact = 0; + int ambig = 0; + int indfound = 0; + int option_index; + + /* This is an option that requires an argument. */ + if (*nextchar != '\0') + { + optarg = nextchar; + /* If we end this ARGV-element by taking the rest as an arg, + we must advance to the next element now. */ + optind++; + } + else if (optind == argc) + { + if (opterr) + { + /* 1003.2 specifies the format of this message. */ + fprintf (stderr, _("%s: option requires an argument -- %c\n"), + argv[0], c); + } + optopt = c; + if (optstring[0] == ':') + c = ':'; + else + c = '?'; + return c; + } + else + /* We already incremented `optind' once; + increment it again when taking next ARGV-elt as argument. */ + optarg = argv[optind++]; + + /* optarg is now the argument, see if it's in the + table of longopts. */ + + for (nextchar = nameend = optarg; *nameend && *nameend != '='; nameend++) + /* Do nothing. */ ; + + /* Test all long options for either exact match + or abbreviated matches. */ + for (p = longopts, option_index = 0; p->name; p++, option_index++) + if (!strncmp (p->name, nextchar, nameend - nextchar)) + { + if ((unsigned int) (nameend - nextchar) == strlen (p->name)) + { + /* Exact match found. */ + pfound = p; + indfound = option_index; + exact = 1; + break; + } + else if (pfound == NULL) + { + /* First nonexact match found. */ + pfound = p; + indfound = option_index; + } + else + /* Second or later nonexact match found. */ + ambig = 1; + } + if (ambig && !exact) + { + if (opterr) + fprintf (stderr, _("%s: option `-W %s' is ambiguous\n"), + argv[0], argv[optind]); + nextchar += strlen (nextchar); + optind++; + return '?'; + } + if (pfound != NULL) + { + option_index = indfound; + if (*nameend) + { + /* Don't test has_arg with >, because some C compilers don't + allow it to be used on enums. */ + if (pfound->has_arg) + optarg = nameend + 1; + else + { + if (opterr) + fprintf (stderr, _("\ +%s: option `-W %s' doesn't allow an argument\n"), + argv[0], pfound->name); + + nextchar += strlen (nextchar); + return '?'; + } + } + else if (pfound->has_arg == 1) + { + if (optind < argc) + optarg = argv[optind++]; + else + { + if (opterr) + fprintf (stderr, + _("%s: option `%s' requires an argument\n"), + argv[0], argv[optind - 1]); + nextchar += strlen (nextchar); + return optstring[0] == ':' ? ':' : '?'; + } + } + nextchar += strlen (nextchar); + if (longind != NULL) + *longind = option_index; + if (pfound->flag) + { + *(pfound->flag) = pfound->val; + return 0; + } + return pfound->val; + } + nextchar = NULL; + return 'W'; /* Let the application handle it. */ + } + if (temp[1] == ':') + { + if (temp[2] == ':') + { + /* This is an option that accepts an argument optionally. */ + if (*nextchar != '\0') + { + optarg = nextchar; + optind++; + } + else + optarg = NULL; + nextchar = NULL; + } + else + { + /* This is an option that requires an argument. */ + if (*nextchar != '\0') + { + optarg = nextchar; + /* If we end this ARGV-element by taking the rest as an arg, + we must advance to the next element now. */ + optind++; + } + else if (optind == argc) + { + if (opterr) + { + /* 1003.2 specifies the format of this message. */ + fprintf (stderr, + _("%s: option requires an argument -- %c\n"), + argv[0], c); + } + optopt = c; + if (optstring[0] == ':') + c = ':'; + else + c = '?'; + } + else + /* We already incremented `optind' once; + increment it again when taking next ARGV-elt as argument. */ + optarg = argv[optind++]; + nextchar = NULL; + } + } + return c; + } +} + +int +getopt (argc, argv, optstring) + int argc; + char *const *argv; + const char *optstring; +{ + return _getopt_internal (argc, argv, optstring, + (const struct option *) 0, + (int *) 0, + 0); +} + +#endif /* Not ELIDE_CODE. */ + +#ifdef TEST + +/* Compile with -DTEST to make an executable for use in testing + the above definition of `getopt'. */ + +int +main (argc, argv) + int argc; + char **argv; +{ + int c; + int digit_optind = 0; + + while (1) + { + int this_option_optind = optind ? optind : 1; + + c = getopt (argc, argv, "abc:d:0123456789"); + if (c == -1) + break; + + switch (c) + { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + if (digit_optind != 0 && digit_optind != this_option_optind) + printf ("digits occur in two different argv-elements.\n"); + digit_optind = this_option_optind; + printf ("option %c\n", c); + break; + + case 'a': + printf ("option a\n"); + break; + + case 'b': + printf ("option b\n"); + break; + + case 'c': + printf ("option c with value `%s'\n", optarg); + break; + + case '?': + break; + + default: + printf ("?? getopt returned character code 0%o ??\n", c); + } + } + + if (optind < argc) + { + printf ("non-option ARGV-elements: "); + while (optind < argc) + printf ("%s ", argv[optind++]); + printf ("\n"); + } + + exit (0); +} + +#endif /* TEST */ diff --git a/st2gpx/src/getopt.h b/st2gpx/src/getopt.h new file mode 100644 index 000000000..a0fe18aee --- /dev/null +++ b/st2gpx/src/getopt.h @@ -0,0 +1,131 @@ +/* Declarations for getopt. + Copyright (C) 1989,90,91,92,93,94,96,97 Free Software Foundation, Inc. + This file is part of the GNU C Library. + + The GNU C Library is free software; you can redistribute it and/or + modify it under the terms of the GNU Library General Public License as + published by the Free Software Foundation; either version 2 of the + License, or (at your option) any later version. + + The GNU C Library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Library General Public License for more details. + + You should have received a copy of the GNU Library General Public + License along with the GNU C Library; see the file COPYING.LIB. If not, + write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, + Boston, MA 02111-1307, USA. */ + +#ifndef _GETOPT_H +#define _GETOPT_H 1 + +#ifdef __cplusplus +extern "C" { +#endif + +/* For communication from `getopt' to the caller. + When `getopt' finds an option that takes an argument, + the argument value is returned here. + Also, when `ordering' is RETURN_IN_ORDER, + each non-option ARGV-element is returned here. */ + +extern char *optarg; + +/* Index in ARGV of the next element to be scanned. + This is used for communication to and from the caller + and for communication between successive calls to `getopt'. + + On entry to `getopt', zero means this is the first call; initialize. + + When `getopt' returns -1, this is the index of the first of the + non-option elements that the caller should itself scan. + + Otherwise, `optind' communicates from one call to the next + how much of ARGV has been scanned so far. */ + +extern int optind; + +/* Callers store zero here to inhibit the error message `getopt' prints + for unrecognized options. */ + +extern int opterr; + +/* Set to an option character which was unrecognized. */ + +extern int optopt; + +/* Describe the long-named options requested by the application. + The LONG_OPTIONS argument to getopt_long or getopt_long_only is a vector + of `struct option' terminated by an element containing a name which is + zero. + + The field `has_arg' is: + no_argument (or 0) if the option does not take an argument, + required_argument (or 1) if the option requires an argument, + optional_argument (or 2) if the option takes an optional argument. + + If the field `flag' is not NULL, it points to a variable that is set + to the value given in the field `val' when the option is found, but + left unchanged if the option is not found. + + To have a long-named option do something other than set an `int' to + a compiled-in constant, such as set a value from `optarg', set the + option's `flag' field to zero and its `val' field to a nonzero + value (the equivalent single-letter option character, if there is + one). For long options that have a zero `flag' field, `getopt' + returns the contents of the `val' field. */ + +struct option +{ +#if defined (__STDC__) && __STDC__ + const char *name; +#else + char *name; +#endif + /* has_arg can't be an enum because some compilers complain about + type mismatches in all the code that assumes it is an int. */ + int has_arg; + int *flag; + int val; +}; + +/* Names for the values of the `has_arg' field of `struct option'. */ + +#define no_argument 0 +#define required_argument 1 +#define optional_argument 2 + +//#if defined (__STDC__) && __STDC__ +//#ifdef __GNU_LIBRARY__ +/* Many other libraries have conflicting prototypes for getopt, with + differences in the consts, in stdlib.h. To avoid compilation + errors, only prototype getopt for the GNU C library. */ +extern int getopt (int argc, char *const *argv, const char *shortopts); +//#else /* not __GNU_LIBRARY__ */ +extern int getopt (); +//#endif /* __GNU_LIBRARY__ */ +extern int getopt_long (int argc, char *const *argv, const char *shortopts, + const struct option *longopts, int *longind); +extern int getopt_long_only (int argc, char *const *argv, + const char *shortopts, + const struct option *longopts, int *longind); + +/* Internal only. Users should not call this directly. */ +extern int _getopt_internal (int argc, char *const *argv, + const char *shortopts, + const struct option *longopts, int *longind, + int long_only); +//#else /* not __STDC__ */ +//extern int getopt (); +//extern int getopt_long (); +//extern int getopt_long_only (); + +//extern int _getopt_internal (); +//#endif /* __STDC__ */ + +#ifdef __cplusplus +} +#endif + +#endif /* _GETOPT_H */ diff --git a/st2gpx/src/pushpins.cpp b/st2gpx/src/pushpins.cpp new file mode 100644 index 000000000..2143019ee --- /dev/null +++ b/st2gpx/src/pushpins.cpp @@ -0,0 +1,224 @@ +/* + pushpins.cpp + + Extract data from MS Streets & Trips .est and Autoroute .axe files in GPX format. + + Copyright (C) 2003 James Sherring, james_sherring@yahoo.com + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111 USA +*/ + +#import "c:\program files\common files\system\ado\msado15.dll" rename ( "EOF", "adoEOF" ) +//#import rename ( "EOF", "adoEOF" ) + +#include +#include // Include only once in your application +//#include "adoid.h" // ADO GUID's +//#include "adoint.h" // ADO Classes, enums, etc. +#include // for sysstringlength +#include +//#include +//#include +//#include +#include + +#include "pushpins.h" + +struct InitOle { +InitOle() { ::CoInitialize(NULL); } +~InitOle() { ::CoUninitialize(); } +} _init_InitOle_; + +int verbose_flag; + +void * xmalloc(size_t size) +{ + void *obj = malloc(size); + if (!obj) + { + fprintf(stderr, "Unable to allocate %d bytes of memory.\n", size); + } + return obj; +} + +LPWSTR wstr2cpy(BSTR wstr) +{ + int len=wcslen(wstr); + LPWSTR newstr=(LPWSTR)xmalloc((len+1)*sizeof(WCHAR)); + wcscpy(newstr, wstr); + return newstr; +} + +char* wstr2str(BSTR wstr) +// there must be a better way to do this +{ + int len; + int i; + char* newstr=NULL; + // call to get length + len = WideCharToMultiByte( + CP_THREAD_ACP, + 0, + wstr, + -1, + newstr, + 0, + NULL, + 0); + if(len==0) + { + //printf("wide2normal got length %d\n", len); + len=wcslen(wstr); + //printf("wide2normal cheated and got length %d\n", len); + }; + newstr = (char*)xmalloc((len+1)*sizeof(char)); + // now call to set string + len = WideCharToMultiByte( + CP_THREAD_ACP, + 0, + wstr, + -1, + newstr, + len, + NULL, + 0); + //printf("wide2normal copied %d chars and got string %s\n", len, newstr); + if (len==0) + { + len=wcslen(wstr); + for(i=0; iOpen(sqlstr, + cnstr, + ADODB::adOpenForwardOnly, + ADODB::adLockReadOnly, + -1 ); + hr = rs->MoveFirst(); + while ((rs->adoEOF == FALSE)) + { + ppin = (struct pushpin *)xmalloc(sizeof(struct pushpin)); + + readfield(rs->Fields->GetItem("UdId")->Value, VT_I4, &(ppin->UdId)); + readfield(rs->Fields->GetItem("UdName")->Value, VT_BSTR,&(ppin->UdName)); + readfield(rs->Fields->GetItem("Grid")->Value, VT_I4, &(ppin->Grid)); + readfield(rs->Fields->GetItem("Precision")->Value, VT_I4, &(ppin->Precision)); + readfield(rs->Fields->GetItem("NoteShort")->Value, VT_BSTR,&(ppin->NoteShort)); + + if (verbose_flag > 3) + printf("Read pushpin UdId=%d, UdName=%s, Grid=%d, Precision=%d, NoteShort=%s\n", + ppin->UdId, ppin->UdName, + ppin->Grid, ppin->Precision, ppin->NoteShort); + + ppin_list[ppinnum]=ppin; + ppinnum++; + if (ppinnum>MAX_PUSHPINS-1) + { + printf("Exceeded maximun number of pushpins (I should fix this)\n"); + break; + } + + hr = rs->MoveNext(); + } + hr = rs->Close(); + rs = NULL; + } + catch( _com_error &e) + { + _bstr_t bstrSource(e.Source()); + _bstr_t bs = _bstr_t(" Error: ") + _bstr_t(e.Error()) + _bstr_t(" Msg: ") + + _bstr_t(e.ErrorMessage()) + _bstr_t(" Description: ") + + _bstr_t(e.Description()); + + MessageBox(0,bs,bstrSource, MB_OK); + } +} diff --git a/st2gpx/src/pushpins.h b/st2gpx/src/pushpins.h new file mode 100644 index 000000000..e699a409f --- /dev/null +++ b/st2gpx/src/pushpins.h @@ -0,0 +1,96 @@ +/* + pushpins.h + + Extract data from MS Streets & Trips .est and Autoroute .axe files in GPX format. + + Copyright (C) 2003 James Sherring, james_sherring@yahoo.com + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111 USA + +*/ + +#ifdef __cplusplus +extern "C" { +#endif + +#define MAX_PUSHPINS 5000 + +// max size to be read from ppin memo fields +#define MAX_PPIN_MEMO 1000 + +typedef struct pushpin +{ + long UdId; + int SetId; + long Grid; + long Precision; +// dword RenderData; +// byte MatchId; +// long MOBBId; +// long SourceUdId; +// bool IsTerritory; +// + char* UdName; // max 128 +// bool NoNameSearch; +// byte NoteTypeId; + char* NoteShort; // max 255 +// char* NoteLong; // memo +// char* GeocodeShort; // max 255 +// char* GeocodeLong; // memo +// byte GeocodeHierarchy; +// byte GeocodeContext; +// OLE Object EntityArray ???? +// +// shouldn't include these two here because they are not part of the native pushpin definition + double lat; + double lon; +} tag_pushpin; + + +typedef struct pushpinset +{ + int SetId; + char* SetName; // max 128 +/* byte RenderMethod; + byte GeocodeMethod; + byte CreateMethod; + byte GeometryType; + char[128] RenderData; + long UdCount; + long MatchedCount; + long SkippedCount; + long UnmatchedCount; + long CounterUpdateMask; + int ParentSetId; + bool IsRendered; + long Z_Order; + long GeocodeCtxt; + OLE Object ThemeRenderData + date/time LastGeocoded + char* DataSrcDescr; // memo + char[30] CurrencyData; +*/ +} tag_pushpinset; + +//struct pushpin * ppin_list[MAX_PUSHPINS]; +struct pushpin * ppin_list[5000]; + +//EXTERN_C + void read_ppin_list(char* ppin_file_name); + + +#ifdef __cplusplus +} /* closing brace for extern "C" */ +#endif diff --git a/st2gpx/src/st2gpx.c b/st2gpx/src/st2gpx.c new file mode 100644 index 000000000..8b5c17a75 --- /dev/null +++ b/st2gpx/src/st2gpx.c @@ -0,0 +1,1523 @@ +/* + st2gpxmain.c + + Extract data from MS Streets & Trips .est and Autoroute .axe files in GPX format. + + Copyright (C) 2003 James Sherring, james_sherring@yahoo.com + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111 USA + + +History: + +21-10-2003 annotations stream dump +27-10-2003 journey & pushpins using VB module + 8-11-2003 match journey route-points to pushpins, + integrate parts into singel C/C++ exe (except istorage) + 9-11-2003 fixed invalid gpx + +To do: + Get lat & lon for journey route points not matched to pushpins + Get point info for non-line annotations, e.g. text boxes. + Import functionality + Implement using platform independant libraries. + +bugs: + unable to delete UserData file after accessing with ADO. +*/ + +#include +#include +#include +#include +#include +#include + +// #include +#include "getopt.h" +#include "pushpins.h" + +#ifndef M_PI +#define M_PI 3.1415926535 +#endif + +#define JOUR_FILE_HEAD_LEN 32 +#define JOUR_FILE_TAIL_LEN 430 +// + text1 +2*text2 +#define JOUR_WPTREC_LEN 121 + +#define JOUR_FILEOS_NUMREC 16 + +#define JOURWPT_REC_HEAD_LEN 41 + +#define JOURWPT_RECOS_WPTNUM 0 +#define JOURWPT_RECOS_STR1LEN 40 +#define JOURWPT_RECOS_STR1 41 +// + val(JOURWPT_RECOS_STR1LEN) +#define JOURWPT_RECOS_STR2LEN 44 +#define JOURWPT_RECOS_STR2 45 + +#define ANNOT_FILE_HEAD_LEN 12 +// This needs to be long enough to get enough params to decide which record, +// but no biger than the shortest record +#define ANNOT_REC_HEAD_LEN 57 //19 + +#define ANNOT_TYPE_LINE 0 +#define ANNOT_TYPE_OVAL 1 +#define ANNOT_TYPE_TEXT 2 +#define ANNOT_TYPE_CIRCLE 3 + +#define REC_CLOSE_LEN 0 +// offsets for parameters in annotation recods +#define ANNOT_RECOS_TYPE 0 +#define ANNOT_RECOS_ANUM 4 +#define ANNOT_RECOS_TEXTLEN 20 +#define ANNOT_RECOS_TEXT 24 +#define ANNOT_RECOS_LINENUMPOINTS 53 +#define ANNOT_RECOS_LINEJOINFLAG 48 +#define ANNOT_RECOS_XSCALE 48 +#define ANNOT_RECOS_YSCALE 52 + +#define GPX_HEADER1 "\n\n" +#define GPX_THIS_PROGRAM "st2gpx from james_sherring@yahoo.com" +#define GPX_FOOTER "" + +#define GPX_WPT 0 +#define GPX_RTEPT 1 +#define GPX_TRKPT 2 + +/* +typedef struct annotationbuf +{ + int annot_num; + int flags; // bit fields in first byte + int unkn1; // normally 0 + int unkn2; // ? seems to have byte fields + int text_len; + // + 2*text_len bytes of text here + int fill_color; // seems to have byte fields. First byte is fill, other bytes are strange + int line_color; + int line_thickness; // 20 times the point-size + int arrow_type; // 00=none, 01=left, 02=right, 03=both + int unkn3; + int joinflag; // 0 line does not join, 1, joins. Not sure what large balues for non-lines mean - xscale? + char unkn4; // y-scale? + int num_points; // different meaning for non-lines +} structannotationbuf; +*/ + +typedef struct jourwpt_rec +{ + int jour_num; + int text1_length; + char* text1; + int text2_length; + char* text2; + long UdId; + struct pushpin* pushpin; + int buf_length; + char* buf; +} tag_jour_rec; + +typedef struct gpx_point +{ + float lat; + float lon; + float height; +} tag_gpx_point; + +typedef char* annot_file_header; +typedef char* annot_rec_header; +typedef char* annot_buf; + +typedef struct annot_rec +{ + int type; + int length; + char* buf; + int annot_num; + int text_length; + char* text; + int line_points; +} tag_annot_rec; + +struct point { + double lon; + double lat; +} tag_point; + +struct ms_point { + long grid; + long precision; +} tag_ms_point; + + +// Also need to include variable text length + line-points with these +int annot_rec_len[4]={57, 868, 124, 868}; +int annot_head_len[4]={57, 48, 48, 48}; +char* annot_type_name[4]={"Line", "Oval", "Textbox", "Circle"}; +static char* gpxptypelabel[] = {"wpt", "rtept", "trkpt"}; + +// constants for converting from MS Grid & Precision to latitude and longitude +double magic1 = 182.044444444444; +double magic2 = 0x10000; + +// Args set by getopt etc + +FILE* ppin_file=NULL; +FILE* jour_file=NULL; +FILE* annot_file=NULL; +FILE* gpx_file=NULL; +char* source_file_name=NULL; + +/* Flag set by --verbose. */ +// 0 - only errors +// 1 also the structured data output, e.g. line point info +// 2 also record types & parameters +// 3 also detailed summary info +// 4 also detailed analysis of headers & record params +// 5 also dump buffers +// 6 lots of debug info +static int verbose_flag = 2; +static int explore_flag = 0; +// force line-type annotations to be exported as GPX routes instead of tracks +static int use_gpx_route = 0; + +// std_anotfile_header[8,9] are variable (number of annotations) +char std_annotfile_header[ANNOT_FILE_HEAD_LEN] = + {0x34, 0x12, 0x00, 0x2d, 0x03, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00}; + +void * xmalloc(size_t size) +{ + void *obj = malloc(size); + if (!obj) + { + fprintf(stderr, "Unable to allocate %d bytes of memory.\n", size); + } + return obj; +} + +void * xrealloc(void* ptr, size_t size) +{ + void *obj = realloc(ptr, size); + if (!obj) + { + fprintf(stderr, "Unable to (re)allocate %d bytes of memory.\n", size); + } + return obj; +} + +int fixhex(char c) +{ +// gcc (version?) does not print single byte hex vaues properly +// eg 0xe3 prints as 0xFFFFFFE3 +// this is only a problem for values above 0x80 +// Or maybe that is the proper handling of unsigned? +// Aaaahhh. I should use %u for printing unsigned... but the hex problem is still there + if(c & 0x80) + { + return ((int)c-0xFFFFFF00); + } else + return c; +} + +void printbuf(char* buf, int len) +{ +// unsigned i; + int i; + printf(" 0 1 2 3 4 5 6 7 8 9 A B C D E F\n"); + printf(" -----------------------------------------------"); + for(i=0; i> i; + lon_val += (lon_mask & msp.grid) >> (i+1); + lat_mask <<= 2; + lon_mask <<= 2; + } + + //printf("so far, lat_val=%d, lon_val=%d\n",lat_val ,lon_val); + + // Dont divide by magic1 until accounting for precision, + // because that would introduce rounding errors + p.lat = (double) lat_val ;// magic1; + p.lon = (double) lon_val ;// magic1; + + //printf("so far, got lat= %f lon= %f\n", p.lat, p.lon); + + lat_mask=1; + lon_mask=2; + lat_val=0; + lon_val=0; + + for (i=0; i<16; i++) { + lat_val += (lat_mask & msp.precision) >> i; + lon_val += (lon_mask & msp.precision) >> (i+1); + lat_mask <<= 2; + lon_mask <<= 2; + } + + //printf("so far, lat_val=%d, lon_val=%d\n",lat_val ,lon_val); + + p.lat += (double) lat_val / (magic2); + p.lon += (double) lon_val / (magic2); + + p.lat *= 1/ (magic1); + p.lon *= 1/ (magic1); + + //printf("so far, got lat= %f lon= %f\n", p.lat, p.lon); + + if (p.lon > 180) p.lon -= 360; + if (p.lat > 180) p.lat -= 360; + return p; +} + +void explore_annot(struct annot_rec rec) +{ + char* header; + char* tail; + int taillength; + + header = (char*)xmalloc(ANNOT_REC_HEAD_LEN); + memcpy(header, rec.buf, ANNOT_RECOS_TEXT); + memcpy(header+ANNOT_RECOS_TEXT+2*rec.text_length, rec.buf, + ANNOT_REC_HEAD_LEN-ANNOT_RECOS_TEXT); + + tail = rec.buf+ANNOT_REC_HEAD_LEN+2*rec.text_length; + taillength = rec.length - ANNOT_REC_HEAD_LEN+2*rec.text_length; + + printf("Record buffer\n", annot_type_name[rec.type]); + printbuf(rec.buf, rec.length); + printf("Record high buffer\n", annot_type_name[rec.type]); + printbufhigh(rec.buf, rec.length); + printf("Record wide header:\n", annot_type_name[rec.type]); + printbufwide(header, ANNOT_REC_HEAD_LEN); + printf("Record tail:\n"); + printbuf(tail, taillength); + printf("Record wide tail:\n"); + printbufwide(tail, taillength); + printf("Record tail as floats:\n"); + printbufasfloat(tail, taillength); + printf("Record tail as points:\n"); + printbufaspoints(tail, taillength); +// if (rec.type == ANNOT_TYPE_TEXT) +// { + //printfloatbuf((float*)(tail+3), taillength/4 -1); +// } +// else if (rec.type == ANNOT_TYPE_OVAL ) +// printfloatbuf((float*)(tail+3), taillength/4 -1); +// else if (rec.type == ANNOT_TYPE_CIRCLE )) +// printfloatbuf((float*)(tail+3), taillength/4 -1); + free(header); +} + +void gpx_open_write_file_header(char* gpx_file_name) +{ + if (gpx_file_name) + { + gpx_file = fopen(gpx_file_name, "w"); + if (gpx_file == NULL) + { + fprintf(stderr, "Cannot open %s\n", optarg); + exit(1); + } + } + else + return; + + if (gpx_file!=NULL) + { + fprintf(gpx_file, GPX_HEADER1); + fprintf(gpx_file, GPX_HEADER2); + if (source_file_name) + fprintf(gpx_file, "\t=\"This file was created from %s by %s\"\n", + source_file_name, GPX_THIS_PROGRAM); + // Some more tags we should add here + // Descriptive name of the GPX file + // Description of the GPX file + // Name of the file's creator + //